Efficient implementation of 3X for radix-8 encoding
نویسندگان
چکیده
Several commercial processors have selected the radix-8 multiplier architecture to increase their speed, thereby reducing the number of partial products. Radix-8 encoding reduces the digit number length in a signed digit representation. Its performance bottleneck is the generation of the term 3X, also referred to as hard multiple. This term is usually computed by an adding and shifting operation, 3X 1⁄4 2X+X, in a high-speed adder. In a 2X+X addition, close full adders share the same input signal. This property permits simplified algebraic expressions associated to a 3X operation other than in a conventional addition. This paper shows that the 3X operation can be expressed in terms of two signals, Hi and Ki, functionally equivalent to two carries. Hi and Ki are computed in parallel using architectures which lead to an areaand speed-efficient implementation. For the purposes of comparison, implementation based on standard cells of conventional adders has been compared with the proposed circuits based on these Hi and Ki signals. As a result, the delay of the proposed serial scheme is reduced by roughly 67% without additional cost in area, the delay and area of the carry look-ahead scheme is reduced by 20% and 17%, and that of the parallel prefix scheme is reduced by 26% and 46%, respectively. r 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
Efficient hardware implementation of 3X for radix-8 encoding [6590-40]
Several commercial processors have selected the radix-8 multiplier architecture to increase their speed, thereby reducing the number of partial products. Radix-8 encoding reduces the digit number length in a signed digit representation. Its performance bottleneck is the generation of the term 3X, also referred to as hard multiple. This term is usually computed by an adding and shifting operatio...
متن کاملHigh Speed Radix-10 Multiplication Using Redundant BCD Codes
In this paper, We propose an algorithm and architecture of a BCD parallel multiplier that exploits some properties of two different redundant BCD codes to speed up its computation. In this paper, we also develop new techniques to reduce the latency and area of previous representative high performance implementations. The Partial products are generated in parallel using a signed-digit radix-10 r...
متن کاملSpeed and Area Optimized Parallel Higher-Radix Modular Multipliers
Modular multiplication is the fundamental and compute-intense operation in many Public-Key crypto-systems. This paper presents two modular multipliers with their efficient architectures based on Booth encoding, higher-radix, and Montgomery powering ladder approaches. Montgomery powering ladder technique enables concurrent execution of main operations in the proposed designs, while higher-radix ...
متن کاملA Review: Area and Delay Efficient Pre- Encoded Multipliers Based on Non- Redundant Radix-4 Encoding
In this paper,we introduce an architecture of pre-encoded multiplier. The radix-4 modular multiplier can be used to implement fast computer applications, e.g RSA cryptosystem and to reduce the number of iterations and pipelining. The performance of these algorithms is primarily determined by the efficient implementation of the modular multiplication and exponentiation. Discussed a Booth's Radix...
متن کاملArea and Power Efficient Booth’s Multipliers Based on Non Redundant Radix-4 Signed- Digit Encoding
In this paper, we introduce an architecture of pre-encoded multipliers for Digital Signal Processing applications based on off-line encoding of coefficients. To this extend, the Non-Redundant radix-4 Signed-Digit (NR4SD) encoding technique, which uses the digit values {-1, 0, +1, +2} or {-2,-1,0,+1}, is proposed leading to a multiplier design with less complex partial products implementation. E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Microelectronics Journal
دوره 39 شماره
صفحات -
تاریخ انتشار 2008